On the Pointwise Implementation of Near-actions

نویسنده

  • ASGER TÖRNQUIST
چکیده

We show that the continuum hypothesis implies that every measure preserving near-action of a group on a standard Borel probability space (X,μ) has a pointwise implementation by Borel measure preserving automorphisms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

POINTWISE PSEUDO-METRIC ON THE L-REAL LINE

In this paper, a pointwise pseudo-metric function on the L-realline is constructed. It is proved that the topology induced by this pointwisepseudo-metric is the usual topology.

متن کامل

Stability and convergence theorems of pointwise asymptotically nonexpansive random operator in Banach space

In this paper, we prove the existence of a random fixed point of by using pointwise asymptotically nonexpansive random operator and the stability resultsof two iterative schemes for random operator.

متن کامل

POINTWISE CONVERGENCE TOPOLOGY AND FUNCTION SPACES IN FUZZY ANALYSIS

We study the space of all continuous fuzzy-valued functions  from a space $X$ into the space of fuzzy numbers $(mathbb{E}sp{1},dsb{infty})$  endowed with the pointwise convergence topology.   Our results generalize the classical ones for  continuous real-valued functions.   The field of applications of this approach seems to be large, since the classical case  allows many known devices to be fi...

متن کامل

On quasi $P$-spaces and their applications in submaximal and nodec spaces

‎A topological space is called submaximal if each of its dense subsets is open and is called nodec if each of its nowhere dense ea subsets is closed‎. ‎Here‎, ‎we study a variety of spaces some of which have already been studied in $C(X)$‎. ‎Among them are‎, ‎most importantly‎, ‎quasi $P$-spaces and pointwise quasi $P$-spaces‎. ‎We obtain some new useful topological characterizations of quasi $...

متن کامل

Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint

We study the worst-case adaptive optimization problem with budget constraint that is useful for modeling various practical applications in artificial intelligence and machine learning. We investigate the near-optimality of greedy algorithms for this problem with both modular and non-modular cost functions. In both cases, we prove that two simple greedy algorithms are not near-optimal but the be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009